Linear Orderings of Subfamilies of AT‐Free Graphs
نویسندگان
چکیده
منابع مشابه
Linear Orderings of Subfamilies of AT-Free Graphs
Asteroidal triple free (AT-free) graphs have been introduced as a generalization of interval graphs, since interval graphs are exactly the chordal AT-free graphs. While for interval graphs it is obvious that there is always a linear ordering of the vertices, such that for each triple of independent vertices the middle one intercepts any path between the remaining vertices of the triple, it is n...
متن کاملLinear Orderings of Random Geometric Graphs
In random geometric graphs, vertices are randomly distributed on [0, 1] and pairs of vertices are connected by edges whenever they are sufficiently close together. Layout problems seek a linear ordering of the vertices of a graph such that a certain measure is minimized. In this paper, we study several layout problems on random geometric graphs: Bandwidth, Minimum Linear Arrangement, Minimum Cu...
متن کاملLinear-Time Succinct Encodings of Planar Graphs via Canonical Orderings
Let G be an embedded planar undirected graph that has n vertices, m edges, and f faces but has no self-loop or multiple edge. If G is triangulated, we can encode it using 4 3m 1 bits, improving on the best previous bound of about 1:53m bits. In case exponential time is acceptable, roughly 1:08m bits have been known to su ce. If G is triconnected, we use at most (2:5 + 2 log 3)minfn; fg 7 bits, ...
متن کاملLexical tree and linear orderings for the middle-levels graphs
Let m = 2k + 1 ∈ Z be odd. The m-cube graph Hm is the Hasse diagram of the Boolean lattice on the coordinate set Zm. A rooted binary tree T is introduced that has as its nodes the translation classes mod m of the weight-k vertices of all Hm, for 0 < k ∈ Z, with an equivalent form of T whose nodes are the translation classes mod m of weight-(k + 1) vertices via complemented reversals of the form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2006
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480104445307